Stern Tube Packing Tests for Deciding Its Packing Size

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Size sensitive packing number for Hamming cube and its consequences

We prove a size-sensitive version of Haussler’s Packing lemma [7] for set-systems with bounded primal shatter dimension, which have an additional size-sensitive property. This answers a question asked by Ezra [9]. We also partially address another point raised by Ezra regarding overcounting of sets in her chaining procedure. As a consequence of these improvements, we get an improvement on the s...

متن کامل

Strip Packing vs. Bin Packing

In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...

متن کامل

On Open Packing Number of Graphs

In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.

متن کامل

Packing Graphs: The packing problem solved

Abstract For every fixed graph H, we determine the H-packing number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, P (H, Kn) = b 2h b n − 1 d cc, unless n = 1 mod d and n(n − 1)/d = b mod (2h/d) where 1 ≤ b ≤ d, in which case P (H, Kn) = b 2h b n ...

متن کامل

Complexity and approximation results for bounded-size paths packing problems

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JOURNAL OF THE MARINE ENGINEERING SOCIETY IN JAPAN

سال: 1968

ISSN: 0388-3051,1884-4758

DOI: 10.5988/jime1966.3.338